Polynomial flow-cut gaps and hardness of directed cut problems
نویسندگان
چکیده
منابع مشابه
Approximation and Hardness Results for Label Cut and Related Problems
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into different categories, represented by a set of labels. The labels may also have weights. We want to pick a subset of labels of minimum cardinality (or minimum total weight), such that the removal of all edges with these ...
متن کاملImproved Hardness for Cut, Interdiction, and Firefighter Problems
We study variants of the classic s-t cut problem and prove the following improved hardness results assuming the Unique Games Conjecture (UGC). • For any constant k ≥ 2 and ǫ > 0, we show that Directed Multicutwith k source-sink pairs is hard to approximate within a factor k − ǫ. This matches the trivial k-approximation algorithm. By a simple reduction, our result for k = 2 implies that Directed...
متن کاملMin Cut , Fast Cut , Polynomial Identities
Throughout this section, G = (V,E) is a multi-graph. A cut of G is a bipartition (S, S̄) of the vertex set of G. The capacity of a cut is the number of edges having one endpoint on both sides of the cut. A min-cut is a cut of minimum capacity. A minimum cut can be computed with the help of maxflow computations. For some vertex s and every other vertex t, one computes the minimum cut separating s...
متن کاملOn constant multi-commodity flow-cut gaps for directed minor-free graphs
The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide & conquer algorithms, and has been extensively studied for various classes of undirected graphs. It has been shown by Linial, London and Rabinovich [15] and by Aumann and Rabani [3] that for general n-vertex graphs it is bounded by Oplog nq and the GuptaNewman-Rabinovich-Sinclair conjectur...
متن کاملOnline Maximum Directed Cut
We investigate a natural online version of the well-known Maximum Directed Cut problem on DAGs. We propose a deterministic algorithm and show that it achieves a competitive ratio of 3 √ 3
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2009
ISSN: 0004-5411,1557-735X
DOI: 10.1145/1502793.1502795